Verification of a Real-time Garbage Collector in Hoare-style Logic
نویسندگان
چکیده
Many of the current software systems rely on garbage collectors for automatic memory management. This is also the case for various software systems in realtime applications. However, a real-time application often requires an incremental working style of the underlying garbage collection, which renders the garbage collector more complex and less trustworthy. We present a formal verification of the Yuasa incremental garbage collector in Hoare-style logic. The specification and proof of the collector are built on a concrete machine model and cover detailed behaviors of the collector which may lead to safety problems but are often ignored in high-level verifications. The work is fully implemented with the Coq proof assistant and can be packed as foundational proof-carrying-code packages. Our work makes an important step toward providing high-assurance garbage collection for mission-critical realtime systems.
منابع مشابه
Verification of an Incremental Garbage Collector in Hoare-Style Logic
Many of the current software systems rely on garbage collectors for automatic memory management. This is also the case for various software systems in real-time applications. However, a real-time application often requires an incremental working style of the underlying garbage collection, which renders the garbage collector more complex and less trustworthy. We present a formal verification of ...
متن کاملSemi-automatic Proofs about Object Graphs in Separation Logic
Published correctness proofs of garbage collectors in separation logic to date depend on extensive manual, interactive formula manipulations. This paper shows that the approach of symbolic execution in separation logic, as first developed by Smallfoot, also encompasses reasoning about object graphs given by the reachability of objects. This approach yields semi-automatic proofs of two central g...
متن کاملGenerational Real-Time Garbage Collection A Three-Part Invention for Young Objects
While real-time garbage collection is now available in production virtual machines, the lack of generational capability means applications with high allocation rates are subject to reduced throughput and high space overheads. Since frequent allocation is often correlated with a high-level, objectoriented style of programming, this can force builders of real-time systems to compromise on softwar...
متن کاملA Logic for Formal Verification of Quantum Programs
This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quantum probabilistic programs. Our target programming language is QPL defined by Selinger, and our logic is an extension of the probabilistic Hoare-style logic defined by den Hartog. In this paper, we demonstrate how the quantum Ho...
متن کاملTowards mechanized correctness proofs for cryptographic algorithms: Axiomatization of a probabilistic Hoare style logic
In [5] we build a formal verification technique for game based correctness proofs of cryptograhic algorithms based on a probabilistic Hoare style logic [10]. An important step towards enabling mechanized verification within this technique is an axiomatization of implication between predicates which is purely semantically defined in [10]. In this paper we provide an axiomatization and illustrate...
متن کامل